Chess Player by Co-Evolutionary Algorithm
نویسندگان
چکیده
A co-evolutionary algorithm (CA) based chess player is presented. Implementation details of the algorithms, namely coding, population, variation operators are described. The alpha-beta or mini-max like behaviour of the player is achieved through two competitive or cooperative populations. Special attention is given to the fitness function evaluation. Preliminary test results showed the prove of principle and the program is able to defeat consistently beginner level players and rival experienced one, but it is still not a contender for other computer based implementations
منابع مشابه
Constraint-based Co-evolutionary Genetic Programming for Bargaining Problems
This thesis applies evolutionary algorithms to tackle bargaining games. Evolutionary algorithms can discover efficient and stationary strategies for various bargaining games. Game-theoretic method requires a substantial amount of mathematical reasoning. Thus this method restricts to simple problems. Moreover, game-theoretic solutions rest on the crucial assumption that every player is perfectly...
متن کاملiCat, the Affective Chess Player
This demo presents “iCat, the Affective Chess Player”, a social robot that is capable of playing chess against a human opponent. The chess game is played on a physical electronic chessboard that detects the board state and sends it to the computer. The goal is to enable children to play with iCat, in a scenario in which the character’s affective state is influenced by every move the player make...
متن کاملCheckers Strategy Evolution with Speciated Neural Networks
Checkers is a very simple game and easy to learn. Unlike chess, it is simple to move and needs a few rules. With respect to checkers, the evolutionary algorithm can discover a neural network that can be used to play at a near-expert level without injecting expert knowledge about how to play the game. Evolutionary approach does not need any prior knowledge to develop machine player but can devel...
متن کاملPlayer Modeling, Search Algorithms and Strategies in Multi-player Games
For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less, and although literature of game theory f...
متن کاملEvaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ideal choice. We describe our implementation of a parallel island model and evaluate it in the context of the Chess Endgame data set from the UCI machine learning repository. We are mainly interested in impact of paralle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.06710 شماره
صفحات -
تاریخ انتشار 2004